Regular bipartite graphs with three distinct non-negative eigenvalues

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Small graphs with exactly two non-negative eigenvalues

Let $G$ be a graph with eigenvalues $lambda_1(G)geqcdotsgeqlambda_n(G)$. In this paper we find all simple graphs $G$ such that $G$ has at most twelve vertices and $G$ has exactly two non-negative eigenvalues. In other words we find all graphs $G$ on $n$ vertices such that $nleq12$ and $lambda_1(G)geq0$, $lambda_2(G)geq0$ and $lambda_3(G)0$, $lambda_2(G)>0$ and $lambda_3(G)

متن کامل

Two spectral characterizations of regular, bipartite graphs with five eigenvalues

Graphs with a few distinct eigenvalues usually possess an interesting combinatorial structure. We show that regular, bipartite graphs with at most six distinct eigenvalues have the property that each vertex belongs to the constant number of quadrangles. This enables to determine, from the spectrum alone, the feasible families of numbers of common neighbors for each vertex with other vertices in...

متن کامل

More on Non-regular Bipartite Integral Graphs with Maximum Degree 4 Not Having ±1 as Eigenvalues

A graph is integral if the spectrum (of its adjacency matrix) consists entirely of integers. The problem of determining all non-regular bipartite integral graphs with maximum degree four which do not have ±1 as eigenvalues was posed in K.T. Balińska, S.K. Simić, K.T. Zwierzyński: Which nonregular bipartite integral graphs with maximum degree four do not have ±1 as eigenvalues? Discrete Math., 2...

متن کامل

More on Graphs with Just Three Distinct Eigenvalues

Let G be a graph of order n with (0, 1)-adjacency matrix A. An eigenvalue σ of A is said to be an eigenvalue of G, and σ is a main eigenvalue if the eigenspace EA(σ) is not orthogonal to the all-1 vector in IR. Always the largest eigenvalue, or index, of G is a main eigenvalue, and it is the only main eigenvalue if and only if G is regular. We say that G is an integral graph if every eigenvalue...

متن کامل

Graphs with three distinct eigenvalues and largest eigenvalue less than

Article history: Received 13 June 2008 Accepted 13 November 2008 Available online xxxx Submitted by R.A. Brualdi AMS classification: 05C50

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2013

ISSN: 0024-3795

DOI: 10.1016/j.laa.2012.12.036